CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions
نویسنده
چکیده
We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-systemM of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-systemM′ of restarting automata of the same type asM that, working in the new mode ed, accepts the language Lm(M) that M accepts in mode m. Further, we will see that in mode ed, a locally deterministic CD-system of restarting automata of type RR(W)(W) can be simulated by a locally deterministic CD-system of restarting automata of the more restricted type R(W)(W). This is the first time that a non-monotone type of R-automaton without auxiliary symbols is shown to be as expressive as the corresponding type of RR-automaton.
منابع مشابه
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of context-free trace languages.
متن کاملLower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata
Some lower bound results are presented that separate the language classes accepted by certain types of nonforgetting restarting automata or CD-systems of restarting automata from each other.
متن کاملOn Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One
It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, the CD-system itself is not, as in each of its computations, the initial component and the successor ...
متن کاملRelations and Transductions Realized by Restarting Automata
In the present thesis we introduce several ways of extending restarting automata to devices for realizing binary (word) relations, which is mainly motivated by linguistics. In particular, we adapt the notion of input/output-relations and proper-relations to restarting automata and to parallel communicating systems of two restarting automata (PC-systems). Further, we introduce a new model, calle...
متن کامل